Serveur d'exploration sur l'OCR

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Experiments on Extracting Knowledge from a Machine-Readable Dictionary of Synonym Differences

Identifieur interne : 001B38 ( Main/Exploration ); précédent : 001B37; suivant : 001B39

Experiments on Extracting Knowledge from a Machine-Readable Dictionary of Synonym Differences

Auteurs : Diana Zaiu Inkpen [Canada, États-Unis] ; Graeme Hirst [Canada, États-Unis]

Source :

RBID : ISTEX:504C2D9D361F39752D2868EE3674FB530CA7A8C7

Abstract

Abstract: In machine translation and natural language generation, making the wrong word choice from a set of near-synonyms can be imprecise or awkward, or convey unwanted implications. Using Edmonds’s model of lexical knowledge to represent clusters of near-synonyms, our goal is to automatically derive a lexi- cal knowledge-base from the Choose the Right Word dictionary of near-synonym discrimination. We do this by automatically classifying sentences in this dictio- nary according to the classes of distinctions they express. We use a decision-list learning algorithm to learn words and expressions that characterize the classes DENOTATIONAL DISTINCTIONS and ATTITUDE-STYLE DISTINCTIONS. These results are then used by an extraction module to actually extract knowledge from each sentence. We also integrate a module to resolve anaphors and word-to-word comparisons. We evaluate the results of our algorithm for several randomly se- lected clusters against a manually built standard solution, and compare them with the results of a baseline algorithm.

Url:
DOI: 10.1007/3-540-44686-9_28


Affiliations:


Links toward previous steps (curation, corpus...)


Le document en format XML

<record>
<TEI wicri:istexFullTextTei="biblStruct">
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">Experiments on Extracting Knowledge from a Machine-Readable Dictionary of Synonym Differences</title>
<author>
<name sortKey="Zaiu Inkpen, Diana" sort="Zaiu Inkpen, Diana" uniqKey="Zaiu Inkpen D" first="Diana" last="Zaiu Inkpen">Diana Zaiu Inkpen</name>
</author>
<author>
<name sortKey="Hirst, Graeme" sort="Hirst, Graeme" uniqKey="Hirst G" first="Graeme" last="Hirst">Graeme Hirst</name>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:504C2D9D361F39752D2868EE3674FB530CA7A8C7</idno>
<date when="2001" year="2001">2001</date>
<idno type="doi">10.1007/3-540-44686-9_28</idno>
<idno type="url">https://api.istex.fr/document/504C2D9D361F39752D2868EE3674FB530CA7A8C7/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">002972</idno>
<idno type="wicri:Area/Istex/Curation">002771</idno>
<idno type="wicri:Area/Istex/Checkpoint">001192</idno>
<idno type="wicri:doubleKey">0302-9743:2001:Zaiu Inkpen D:experiments:on:extracting</idno>
<idno type="wicri:Area/Main/Merge">001C31</idno>
<idno type="wicri:Area/Main/Curation">001B38</idno>
<idno type="wicri:Area/Main/Exploration">001B38</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title level="a" type="main" xml:lang="en">Experiments on Extracting Knowledge from a Machine-Readable Dictionary of Synonym Differences</title>
<author>
<name sortKey="Zaiu Inkpen, Diana" sort="Zaiu Inkpen, Diana" uniqKey="Zaiu Inkpen D" first="Diana" last="Zaiu Inkpen">Diana Zaiu Inkpen</name>
<affiliation wicri:level="4">
<country xml:lang="fr">Canada</country>
<wicri:regionArea>Department of Computer Science, University of Toronto, M5S 3G4, Toronto, Ontario</wicri:regionArea>
<orgName type="university">Université de Toronto</orgName>
<placeName>
<settlement type="city">Toronto</settlement>
<region type="state">Ontario</region>
</placeName>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">États-Unis</country>
</affiliation>
</author>
<author>
<name sortKey="Hirst, Graeme" sort="Hirst, Graeme" uniqKey="Hirst G" first="Graeme" last="Hirst">Graeme Hirst</name>
<affiliation wicri:level="4">
<country xml:lang="fr">Canada</country>
<wicri:regionArea>Department of Computer Science, University of Toronto, M5S 3G4, Toronto, Ontario</wicri:regionArea>
<orgName type="university">Université de Toronto</orgName>
<placeName>
<settlement type="city">Toronto</settlement>
<region type="state">Ontario</region>
</placeName>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">États-Unis</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series>
<title level="s">Lecture Notes in Computer Science</title>
<imprint>
<date>2001</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">504C2D9D361F39752D2868EE3674FB530CA7A8C7</idno>
<idno type="DOI">10.1007/3-540-44686-9_28</idno>
<idno type="ChapterID">28</idno>
<idno type="ChapterID">Chap28</idno>
</biblStruct>
</sourceDesc>
<seriesStmt>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass></textClass>
<langUsage>
<language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">Abstract: In machine translation and natural language generation, making the wrong word choice from a set of near-synonyms can be imprecise or awkward, or convey unwanted implications. Using Edmonds’s model of lexical knowledge to represent clusters of near-synonyms, our goal is to automatically derive a lexi- cal knowledge-base from the Choose the Right Word dictionary of near-synonym discrimination. We do this by automatically classifying sentences in this dictio- nary according to the classes of distinctions they express. We use a decision-list learning algorithm to learn words and expressions that characterize the classes DENOTATIONAL DISTINCTIONS and ATTITUDE-STYLE DISTINCTIONS. These results are then used by an extraction module to actually extract knowledge from each sentence. We also integrate a module to resolve anaphors and word-to-word comparisons. We evaluate the results of our algorithm for several randomly se- lected clusters against a manually built standard solution, and compare them with the results of a baseline algorithm.</div>
</front>
</TEI>
<affiliations>
<list>
<country>
<li>Canada</li>
<li>États-Unis</li>
</country>
<region>
<li>Ontario</li>
</region>
<settlement>
<li>Toronto</li>
</settlement>
<orgName>
<li>Université de Toronto</li>
</orgName>
</list>
<tree>
<country name="Canada">
<region name="Ontario">
<name sortKey="Zaiu Inkpen, Diana" sort="Zaiu Inkpen, Diana" uniqKey="Zaiu Inkpen D" first="Diana" last="Zaiu Inkpen">Diana Zaiu Inkpen</name>
</region>
<name sortKey="Hirst, Graeme" sort="Hirst, Graeme" uniqKey="Hirst G" first="Graeme" last="Hirst">Graeme Hirst</name>
</country>
<country name="États-Unis">
<noRegion>
<name sortKey="Zaiu Inkpen, Diana" sort="Zaiu Inkpen, Diana" uniqKey="Zaiu Inkpen D" first="Diana" last="Zaiu Inkpen">Diana Zaiu Inkpen</name>
</noRegion>
<name sortKey="Hirst, Graeme" sort="Hirst, Graeme" uniqKey="Hirst G" first="Graeme" last="Hirst">Graeme Hirst</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001B38 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001B38 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Ticri/CIDE
   |area=    OcrV1
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:504C2D9D361F39752D2868EE3674FB530CA7A8C7
   |texte=   Experiments on Extracting Knowledge from a Machine-Readable Dictionary of Synonym Differences
}}

Wicri

This area was generated with Dilib version V0.6.32.
Data generation: Sat Nov 11 16:53:45 2017. Site generation: Mon Mar 11 23:15:16 2024